Fixed-parameter algorithms for rectilinear Steiner tree and rectilinear traveling salesman problem in the plane
نویسندگان
چکیده
منابع مشابه
Fixed-Parameter Algorithms for Rectilinear Steiner tree and Rectilinear Traveling Salesman Problem in the plane
Given a set P of n points with their pairwise distances, the traveling salesman problem (TSP) asks for a shortest tour that visits each point exactly once. We consider the rectilinear instances of the TSP, i.e. TSP instances where the points lie in the plane and the distance between two points is the l1 distance. We propose a fixed-parameter algorithm for the Rectilinear TSP running in O ( nh7 ...
متن کاملFaster Approximation Algorithms for the Rectilinear Steiner Tree Problem
The classical Steiner tree problem requires a shortest tree spanning a given vertex subset within a graph G = (V, E). An important variant is the Steiner tree problem in rectilinear metric. Only recently two algorithms were found which achieve better approximations than the “traditional” one with a factor of 3/2. These algorithms with an approximation ratio of 11/8 are quite slow and run in tim...
متن کاملNew algorithms for the rectilinear Steiner tree problem
We discuss a new approach to constructing the rectilinear Steiner tree (RST) of a given set of points in the plane, starting from a minimum spanning tree (MST). The main idea in our approach is to find layouts for the edges of the MST, so as to maximize the overlaps between the layouts, thus minimizing,the cost (i.e., wire length) of the resulting rectilinear Steiner tree. We describe two algor...
متن کاملRectilinear Full Steiner Tree Generation Rectilinear Full Steiner Tree Generation
The fastest exact algorithm (in practice) for the rectilinear Steiner tree problem in the plane uses a two-phase scheme: First a small but suucient set of full Steiner trees (FSTs) is generated and then a Steiner minimum tree is constructed from this set by using simple backtrack search, dynamic programming or an integer programming formulation. FST generation methods can be seen as problem red...
متن کاملDeep-submicron Rectilinear Steiner Tree Problem
This paper presents a fast polynomial approximation algorithm for constructing the Steiner tree of minimum total cost (the cost of the edge (i; j) equal to the rectilinear distance between these nodes) with diierent requirements on delays along each path to destination. The exibility of the proposed algorithm permits to drive the number of Steiner nodes in the solution without increasing the tr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2018
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2018.03.042